// 默认配置
const DEFAULT_CONFIG = {
    id: 'id',
    children: 'children',
    pid: 'pid',
};
// 获取配置。  Object.assign 从一个或多个源对象复制到目标对象
const getConfig = (config) => Object.assign({}, DEFAULT_CONFIG, config);
// tree from list
// 列表中的树
export function listToTree(list, config = {}) {
    const conf = getConfig(config);
    const nodeMap = new Map();
    const result = [];
    const { id, children, pid } = conf;
    for (const node of list) {
        node[children] = node[children] || [];
        nodeMap.set(node[id], node);
    }
    for (const node of list) {
        const parent = nodeMap.get(node[pid]);
        (parent ? parent[children] : result).push(node);
    }
    return result;
}
export function treeToList(tree, config = {}) {
    config = getConfig(config);
    const { children } = config;
    const result = [...tree];
    for (let i = 0; i < result.length; i++) {
        if (!result[i][children])
            continue;
        result.splice(i + 1, 0, ...result[i][children]);
    }
    return result;
}
export function findNode(tree, func, config = {}) {
    config = getConfig(config);
    const { children } = config;
    const list = [...tree];
    for (const node of list) {
        if (func(node))
            return node;
        node[children] && list.push(...node[children]);
    }
    return null;
}
export function findNodeAll(tree, func, config = {}) {
    config = getConfig(config);
    const { children } = config;
    const list = [...tree];
    const result = [];
    for (const node of list) {
        func(node) && result.push(node);
        node[children] && list.push(...node[children]);
    }
    return result;
}
export function findPath(tree, func, config = {}) {
    config = getConfig(config);
    const path = [];
    const list = [...tree];
    const visitedSet = new Set();
    const { children } = config;
    while (list.length) {
        const node = list[0];
        if (visitedSet.has(node)) {
            path.pop();
            list.shift();
        }
        else {
            visitedSet.add(node);
            node[children] && list.unshift(...node[children]);
            path.push(node);
            if (func(node)) {
                return path;
            }
        }
    }
    return null;
}
export function findPathAll(tree, func, config = {}) {
    config = getConfig(config);
    const path = [];
    const list = [...tree];
    const result = [];
    const visitedSet = new Set(), { children } = config;
    while (list.length) {
        const node = list[0];
        if (visitedSet.has(node)) {
            path.pop();
            list.shift();
        }
        else {
            visitedSet.add(node);
            node[children] && list.unshift(...node[children]);
            path.push(node);
            func(node) && result.push([...path]);
        }
    }
    return result;
}
export function filter(tree, func, 
// Partial 将 T 中的所有属性设为可选
config = {}) {
    // 获取配置
    config = getConfig(config);
    const children = config.children;
    function listFilter(list) {
        return list
            .map((node) => ({ ...node }))
            .filter((node) => {
            // 递归调用 对含有children项  进行再次调用自身函数 listFilter
            node[children] = node[children] && listFilter(node[children]);
            // 执行传入的回调 func 进行过滤
            return func(node) || (node[children] && node[children].length);
        });
    }
    return listFilter(tree);
}
export function forEach(tree, func, config = {}) {
    config = getConfig(config);
    const list = [...tree];
    const { children } = config;
    for (let i = 0; i < list.length; i++) {
        //func 返回true就终止遍历，避免大量节点场景下无意义循环，引起浏览器卡顿
        if (func(list[i])) {
            return;
        }
        children && list[i][children] && list.splice(i + 1, 0, ...list[i][children]);
    }
}
/**
 * @description: Extract tree specified structure
 * @description: 提取树指定结构
 */
export function treeMap(treeData, opt) {
    return treeData.map((item) => treeMapEach(item, opt));
}
/**
 * @description: Extract tree specified structure
 * @description: 提取树指定结构
 */
export function treeMapEach(data, { children = 'children', conversion }) {
    const haveChildren = Array.isArray(data[children]) && data[children].length > 0;
    const conversionData = conversion(data) || {};
    if (haveChildren) {
        return {
            ...conversionData,
            [children]: data[children].map((i) => treeMapEach(i, {
                children,
                conversion,
            })),
        };
    }
    else {
        return {
            ...conversionData,
        };
    }
}
/**
 * 递归遍历树结构
 * @param treeDatas 树
 * @param callBack 回调
 * @param parentNode 父节点
 */
export function eachTree(treeDatas, callBack, parentNode = {}) {
    treeDatas.forEach((element) => {
        const newNode = callBack(element, parentNode) || element;
        if (element.children) {
            eachTree(element.children, callBack, newNode);
        }
    });
}
